private Player[] randomizePlayers(Player[] waiting_players, int players_per_battle)
{
ArrayList<Player> accepted_players = new ArrayList<Player>;
for(int i = 0; i < waiting_players.length / players_per_battle; i++)
{
accepted_players.add( waiting_players[i] );
}

/* Builds a list of players that can be evenly distributed into battles.  For snowball, this is 8 players per battle, 4 players per side. */

Player[] rejected_players = new Player[waiting_players.length % players_per_battle];
for(int i = accepted_players.getLength(); i < waiting_players.length; i++)
{
rejected_players[i - accepted_players.getLength()] = waiting_players[i];
}
waiting_players = rejected_players;

/* Gets the non-accepted players and replaces the waiting players with the rejected players.  They'll get to go next round. */

RandomGenerator rand = new RandomGenerator();
Player[] final_player_list = new Player[accepted_players.getLength()];
for(int i = 0; i < final_player_list.length; i++)
{
final_player_list[i] = accepted_players.remove(rand.nextInt() % accepted_players.getLength());
}

/* Fills the final list from start to finish with players from random indexes in the list of accepted players.  The players moved to the final list are removed from the accepted list, so that they are not picked twice.  ArrayList auto-updates its length to be one smaller in a Remove method.  The list of players is now completely as random as computers can make it. */

return final_player_list;

/* Now the existing system which forms teams from left to right can form those teams with a completely random set of players, and syncing no longer works. */
}